package algorithm.leetcode.online.q5nnnnlongestpalindromicsubstring;

//Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.
public class LongestPS {
  public static void main(String[] args){
    String a = "abcdc";
    System.out.println(longestPS(a));
  }
  private static String longestPS(String a){
    String result = "";

    return result;
  }
//  private static String reverse =
}
